Strong Typed Boehm Theorem and Functional Completeness on the Linear Lambda Calculus
نویسنده
چکیده
In this paper, we prove a version of the typed Böhm theorem on the linear lambda calculus, which says, for any given types A and B, when s1 and s2 (respectively, u1 and u2) are different closed terms of A (resp. B), there is a term t such that t s1 =βηc u1 and t s2 =βηc u2 . Several years ago, a weaker version of this theorem was proved, but the stronger version was open. As a corollary of this theorem, we prove that if A has two different closed terms s1 and s2, then A is functionally complete with regard to s1 and s2. So far, it was only known that a few types are functionally complete.
منابع مشابه
Weak Typed Boehm Theorem on IMLL
In the Böhm theorem workshop on Crete island, Zoran Petric called Statman’s “Typical Ambiguity theorem” typed Böhm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda calculus. In this paper, we study the linear version of the typed Böhm theorem on a fragment of Intuitionistic Linear Logic. We show that in the multiplicative fragment ...
متن کاملA Realizability Interpretation for Intersection and Union Types
Proof-functional logical connectives allow reasoning about the structure of logical proofs, in this way giving to the latter the status of first-class objects. This is in contrast to classical truth-functional connectives where the meaning of a compound formula is dependent only on the truth value of its subformulas. In this paper we present a typed lambda calculus, enriched with strong product...
متن کاملCategory Theory for Linear Logicians
This paper presents an introduction to category theory with an emphasis on those aspects relevant to the analysis of the model theory of linear logic. With this in mind, we focus on the basic definitions of category theory and categorical logic. An analysis of cartesian and cartesian closed categories and their relation to intuitionistic logic is followed by a consideration of symmetric monoida...
متن کاملSemantics of Typed Lambda-Calculus with Constructors
Gödel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two disciplines. Following a previous work [3], we consider an extension of the original ludics with contraction and universal nondeterminism, which play dual roles,...
متن کاملLower Bounds for Probabilistic Space Complexity: Communication-Automata Approach
Multiplicative Linear Logic for Resource Transformation Nets p. 81 The Parameterized Complexity of Some Problems in Logic and Linguistics p. 89 Foundations of Proof Search Strategies Design in Linear Logic p. 101 On Extreme Points of Convex Compact Turing Located Set p. 114 Application of Typed Lambda Calculi in the Untyped Lambda Calculus p. 129 Classes with Pairwise Equivalent Enumerations p....
متن کامل